Source Requantization: Successive Degradation and Bit Stealing

We consider source requantization in tw oforms | successive degradation (i.e., source delity reduction) and bit stealing (i.e., information embedding) | when no forward planning has been done to facilitate the requantization. We focus on nite-alphabet sources with arbitrary distortion measures as well as the Gaussian-quadratic scenario. F orthe successive degradation problem, w e show an ac hievable distortion-rate trade-o for non-hierarchically structured rate-distortion achieving codes, and compare it to the distortion-rate trade-o of successively re nable codes. We further consider source requantization in the form of bit stealing, whereby an information embedder acts on a quantized source, producing an output at the same rate. Building on the successive degradation results, we develop achievable distortion-rate trade-o s. Two cases are considered, corresponding to whether the source decoder is informed of any bit stealing or not. In the latter case, the embedder must produce outputs in the original source codebook. F or the Gaussian-quadratic scenario, all trade-o s are within 0.5 bits/sample of the distortion-rate bound. F urthermore, for bit stealing, the use of simple post-reconstruction processing that is only a function of the embedded rate can eliminate the loss experienced by uninformed decoders.